The Klee-Minty random edge chain moves with linear speed
نویسندگان
چکیده
An infinite sequence of 0’s and 1’s evolves by flipping each 1 to a 0 exponentially at rate one. When a 1 flips, all bits to its right also flip. Starting from any configuration with finitely many 1’s to the left of the origin, we show that the leftmost 1 moves right with linear speed. Upper and lower bounds are given on the speed.
منابع مشابه
The Klee-Minty random edge chain moves with bounded speed
An infinite sequence of 0’s and 1’s evolves by flipping each 1 to a 0 exponentially at rate one. When a 1 flips, all bits to its right also flip. Starting from any configuration with finitely many 1’s to the left of the origin, we show that the leftmost 1 moves right with bounded speed. Upper and lower bounds are given on the speed. A consequence is that a lower bound for the run time of the ra...
متن کاملRandomized Simplex Algorithms on Klee-Minty Cubes
We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes [17] and similar linear programs with exponential decreasing paths. The analysis of two most natural randomized pivot rules on the Klee-Minty cubes leads t o (nearly) quadratic lower bounds for the complexity of linear programming with rando...
متن کاملRandomized Simplex Algorithms on Klee-Mintny Cubes
We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes 16] and similar linear programs with exponential decreasing paths. The analysis of two randomized pivot rules on the Klee-Minty cubes leads to (nearly) quadratic lower bounds for the complexity of linear programming with random pivots. Thus ...
متن کاملHow good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
By refining a variant of the Klee–Minty example that forces the central path to visit all the vertices of the Klee–Minty n-cube, we exhibit a nearly worst-case example for path-following interior point methods. Namely, while the theoretical iteration-complexity upper bound is O(2nn 5 2 ), we prove that solving this n-dimensional linear optimization problem requires at least 2n − 1 iterations.
متن کاملA tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes
It is an open question whether there is an interior-point algorithm for linear optimization problems with a lower iteration-complexity than the classical bound O( √ n log(1 μ0 )). This paper provides a negative answer to that question for a variant of the Mizuno-Todd-Ye predictor-corrector algorithm. In fact, we prove that for any > 0, there is a redundant Klee-Minty cube for which the aforemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 30 شماره
صفحات -
تاریخ انتشار 2007